منابع مشابه
Distance-locally disconnected graphs
For an integer k ≥ 1, we say that a (finite simple undirected) graph G is k-distance-locally disconnected, or simply k-locally disconnected if, for any x ∈ V (G), the set of vertices at distance at least 1 and at most k from x induces in G a disconnected graph. In this paper we study the asymptotic behavior of the number of edges of a k-locally disconnected graph on n vertices. For general grap...
متن کاملLocally s-distance transitive graphs
We give a unified approach to analysing, for each positive integer s, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally s-arc transitive graphs of diameter at least s. A graph is in the class if it is connected and if, for each vertex v, the subgroup of automorphisms fixing v acts transitively on the set of vertices at distance i from v, ...
متن کاملLocally Pseudo-Distance-Regular Graphs
The concept of local pseudo-distance-regularity, introduced in this paper, can be thought of as a natural generalization of distance-regularity for non-regular graphs. Intuitively speaking, such a concept is related to the regularity of graph 1 when it is seen from a given vertex. The price to be paid for speaking about a kind of distance-regularity in the non-regular case seems to be locality....
متن کاملRepresentations of Locally Compact Totally Disconnected Groups
Let G be a locally compact totally disconnected group. Recall that every neighborhood of 1 in G contains a compact open subgroup. If G is assumed to be compact, then every neighborhood of 1 in G contains a compact open normal subgroup. On the other hand, it follows from properties of Lie groups that the group GL(n,C) has the property that there is some neighborhood of the identity which contain...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2013
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1657